Asigning a Single Server to Inhomogeneous Queues with Switching Costs
نویسنده
چکیده
In this paper we study the preemptive assignment of a single server to two queues. Customers arrive at both queues according to Poisson processes, and all service times are exponential, but with rates depending on the queues. The costs to be minimized consist of both holding costs and switching costs. The limiting behavior of the switching curve is studied, resulting in a good threshold policy. Numerical results are included to illustrate the complexity of the optimal policy and to compare the optimal policy with the threshold policy. AMS Subject Classification (1991): 90B22, 90C40
منابع مشابه
Stochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملOptimal Stochastic Scheduling of Forest Networks with Switching Penalties 1
We present structural properties of optimal policies for the problem of scheduling a single server in a forest network of N queues (without arrivals) subject to switching penalties. In addition to linear holding costs, we impose either lump sum switching costs or batch setup delays which are incurred at each instant the server processes a job in a queue diierent than the previous one. We use re...
متن کاملOptimal Stochastic Scheduling of Forest Networks with Switching Penalties Author(s):
We present structural properties of optimal policies for the problem of scheduling a single server in a forest network of N queues (without arrivals) subject to switching penalties. In addition to linear holding costs, we impose either lump sum switching costs or batch set-up delays which are incurred at each instant the server processes a job in a queue different from the previous one. We use ...
متن کاملQ Q Ueuing Ueuing a Analysis Nalysis
WHY QUEUING ANALYSIS? ......................................................................................2 QUEUING MODELS......................................................................................................3 The Single-Server Queue.....................................................................................3 Queue Parameters .............................................
متن کاملUnreliable bulk retrial queues with delayed repairs and modified vacation policy
The present investigation deals with the bulk arrival M/G/1 retrial queue with impatient customers and modified vacation policy. The incoming customers join the virtual pool of customers called orbit if they find the server being busy, on vacation or in broken down state otherwise the service of the customer at the head of the batch is started by the server. The service is provided in k</em...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 182 شماره
صفحات -
تاریخ انتشار 1997